Grammar as Logic

نویسنده

  • Glyn Morrill
چکیده

The notion of parsing as deduction appears to presuppose that of grammar as logic though in fact the former has largely involved embedding grammars in logics using a fragment conducive to theorem proving It is well known that categorial grammars take the form of implicational logics in this case the grammar is not embedded but simply is is a logic The paper argues that many further operations may be added to such a grammar the result hav ing close relations with linear logic Thus categorial grammar emerges as the implicational fragment of a much more general logical grammar A Prolog implementation illustrates ap plications to polymorphism optionality intensionality bounded and unbounded extraction and coordination reduction Implication The notion of parsing as deduction appears to presuppose that of grammar as logic though in fact the former has largely involved embedding grammars in powerful logics using a fragment conducive to theorem proving e g embedding context free grammars in the Horn clause fragment of rst order logic cf Pereira and Warren and references therein In categorial grammars the slash connectives behave directly as implication The terms of the language of categories are de ned starting from a set of basic categories as follows a If X is a basic category then X is a category b If X and Y are categories then X Y and XnY are categories A term X Y represents expressions which apply to expressions of category Y on their right to form expressions of category X a term XnY represents expressions which apply to expressions of category Y on their left to form expressions of category X Thus the following will be valid a X Y Y X b Y XnY X Note that a uniform orientation notation is used with arguments appearing on the same side of their value irrespective of directionality The inference from X Y and Y to X is analogous to the inference from Y X and Y to X Consider in particular the product free Associative Lambek Calculus ALC which has a Gentzen style sequent axiomatisation as follows Lambek X X X Z Y L X Y Z X Z Y nL XnY Z

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

A Logic Programming Approach to Parsing and Production in Fluid Construction Grammar

This paper presents a Logic Programming approach to parsing and production in Fluid Construction Grammar (FCG) [13]. It builds on previous work on the formalisation of FCG in terms of First Order Logic (FOL) concepts, more specifically on the definition of its core inference operations, unification and merge, in terms of FOL unification and search in the space of a particular set of FOL terms c...

متن کامل

Chapter 5 A NALYZING C IRCUIT S TRUCTURES AS L ANGUAGE

As a step toward automatic circuit understanding, we present a new method for analyzing circuit structures. We view circuits as sentences, and their elements as words. The electrical behavior and functions are the meaning of the sentences. Circuit structures are defined by a logic grammar called DCSG. A set of grammar rules, when converted into Prolog clauses, forms a logic program which perfor...

متن کامل

Deciding regular grammar logics with converse through first-order logic

We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. This translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions...

متن کامل

Can we transform logic programs into attribute grammars?

In this paper we study the relationship between Attribute Grammars and Logic Programs, concentrating on transforming logic programs into attribute grammars. This has potential applications in compilation techniques for logic programs. It does not seem possible to transform arbitrary Logic Programs into Attribute Grammars, basically because the same logic variables can sometimes be used as input...

متن کامل

A Collective Extension of Relational Grammar

Relational grammar was proposed in Suppes (1976) as a semantical grammar for natural language. Fragments considered so far are restricted to distributive notions. In this article, relational grammar is extended to collective notions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014